Approximation by quasi-interpolation operators and Smolyak's algorithm
نویسندگان
چکیده
We study approximation of multivariate periodic functions from Besov and Triebel–Lizorkin spaces dominating mixed smoothness by the Smolyak algorithm constructed using a special class quasi-interpolation operators Kantorovich-type. These are defined similar to classical sampling replacing samples with average values function on small intervals (or more generally sampled convolution given an appropriate kernel). In this paper, we estimate rate convergence corresponding in Lq-norm for Bp,θs(Td) Fp,θs(Td) all s>0 admissible 1≤p,θ≤∞ as well provide analogues Littlewood–Paley-type characterizations these terms families operators.
منابع مشابه
Scattered data approximation of fully fuzzy data by quasi-interpolation
Fuzzy quasi-interpolations help to reduce the complexity of solving a linear system of equations compared with fuzzy interpolations. Almost all fuzzy quasi-interpolations are focused on the form of $widetilde{f}^{*}:mathbb{R}rightarrow F(mathbb{R})$ or $widetilde{f}^{*}:F(mathbb{R})rightarrow mathbb{R}$. In this paper, we intend to offer a novel fuzzy radial basis function by the concept of so...
متن کاملFinite element quasi-interpolation and best approximation
This paper introduces a quasi-interpolation operator for scalarand vector-valued finite element spaces constructed on affine, shape-regular meshes with some continuity across mesh interfaces. This operator gives optimal estimates of the best approximation error in any Lp-norm assuming regularity in the fractional Sobolev spaces W r,p, where p ∈ [1,∞] and the smoothness index r can be arbitraril...
متن کاملError estimates for some quasi-interpolation operators
‖u− Ihu‖L2(T ) ≤cThT ‖∇ku‖L2(ω̃T ), ‖u− Ihu‖L2(E) ≤cEh E ‖∇ku‖L2(ω̃E). Here, k ∈ {1, 2}, Ih is some quasi-interpolation operator, T and E are a simplex and a face thereof, hT and hE measure the size of T and E, and ω̃T and ω̃E are neighbourhoods of T and E which should be as small as possible. Note that the interpolate Ihu never needs to be computed explicitely. Moreover, for problems in two and th...
متن کاملH2-Matrix Approximation of Integral Operators by Interpolation
Typical panel clustering methods for the fast evaluation of integral operators are based on the Taylor expansion of the kernel function and therefore usually require the user to implement the evaluation of the derivatives of this function up to an arbitrary degree. We propose an alternative approach that replaces the Taylor expansion by simple polynomial interpolation. By applying the interpola...
متن کاملApproximation of Integral Operators by Variable-Order Interpolation
We employ a data-sparse, recursive matrix representation, so-called H 2-matrices, for the efficient treatment of discretized integral operators. We obtained this format using local tensor product interpolants of the kernel function and replacing high-order approximations with piecewise lower-order ones. The scheme has optimal, i.e., linear, complexity in the memory requirement and time for the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complexity
سال: 2022
ISSN: ['1090-2708', '0885-064X']
DOI: https://doi.org/10.1016/j.jco.2021.101601